Search for: All records

A prominent approach to solving combinatorial optimization problems on parallel hardware is Ising machines, i.e., hardware implementations of networks of interacting binary spin variables. Most Ising machines leverage second-order interactions although important classes of optimization problems, such as satisfiability problems, map more seamlessly to Ising networks with higher-order interactions. Here, we demonstrate that higher-order Ising machines can solve satisfiability problems more resource-efficiently in terms of the number of spin variables and their connections when compared to traditional second-order Ising machines. Further, our results show on a benchmark dataset of Booleank-satisfiability problems that higher-order Ising machines implemented with coupled oscillators rapidly find solutions that are better than second-order Ising machines, thus, improving the current state-of-the-art for Ising machines.

 

We investigate the task of retrieving information from compositional distributed representations formed by hyperdimensional computing/vector symbolic architectures and present novel techniques that achieve new information rate bounds. First, we provide an overview of the decoding techniques that can be used to approach the retrieval task. The techniques are categorized into four groups. We then evaluate the considered techniques in several settings that involve, for example, inclusion of external noise and storage elements with reduced precision. In particular, we find that the decoding techniques from the sparse coding and compressed sensing literature (rarely used for hyperdimensional computing/vector symbolic architectures) are also well suited for decoding information from the compositional distributed representations.Combining these decoding techniqueswith interference cancellation ideas from communications improves previously reported bounds (Hersche et al., 2021) of the information rate of the distributed representations from 1.20 to 1.40 bits per dimension for smaller codebooks and from 0.60 to 1.26 bits per dimension for larger codebooks. 

Observations show predictive skill of the minimum sea ice extent (Min SIE) from late winter anomalous offshore ice drift along the Eurasian coastline, leading to local ice thickness anomalies at the onset of the melt season—a signal then amplified by the ice–albedo feedback. We assess whether the observed seasonal predictability of September sea ice extent (Sept SIE) from Fram Strait Ice Area Export (FSIAE; a proxy for Eurasian coastal divergence) is present in global climate model (GCM) large ensembles, namely the CESM2-LE, GISS-E2.1-G, FLOR-LE, CNRM-CM6-1, and CanESM5. All models show distinct periods where winter FSIAE anomalies are negatively correlated with the May sea ice thickness (May SIT) anomalies along the Eurasian coastline, and the following Sept Arctic SIE, as in observations. Counterintuitively, several models show occasional periods where winter FSIAE anomalies are positively correlated with the following Sept SIE anomalies when the mean ice thickness is large, or late in the simulation when the sea ice is thin, and/or when internal variability increases. More important, periods with weak correlation between winter FSIAE and the following Sept SIE dominate, suggesting that summer melt processes generally dominate over late-winter preconditioning and May SIT anomalies. In general, we find that the coupling between the winter FSIAE and ice thickness anomalies along the Eurasian coastline at the onset of the melt season is a ubiquitous feature of GCMs and that the relationship with the following Sept SIE is dependent on the mean Arctic sea ice thickness.

 

Abstract Logical character dependency is a major conceptual and methodological problem in phylogenetic inference of morphological data sets, as it violates the assumption of character independence that is common to all phylogenetic methods. It is more frequently observed in higher-level phylogenies or in data sets characterizing major evolutionary transitions, as these represent parts of the tree of life where (primary) anatomical characters either originate or disappear entirely. As a result, secondary traits related to these primary characters become “inapplicable” across all sampled taxa in which that character is absent. Various solutions have been explored over the last three decades to handle character dependency, such as alternative character coding schemes and, more recently, new algorithmic implementations. However, the accuracy of the proposed solutions, or the impact of character dependency across distinct optimality criteria, has never been directly tested using standard performance measures. Here, we utilize simple and complex simulated morphological data sets analyzed under different maximum parsimony optimization procedures and Bayesian inference to test the accuracy of various coding and algorithmic solutions to character dependency. This is complemented by empirical analyses using a recoded data set on palaeognathid birds. We find that in small, simulated data sets, absent coding performs better than other popular coding strategies available (contingent and multistate), whereas in more complex simulations (larger data sets controlled for different tree structure and character distribution models) contingent coding is favored more frequently. Under contingent coding, a recently proposed weighting algorithm produces the most accurate results for maximum parsimony. However, Bayesian inference outperforms all parsimony-based solutions to handle character dependency due to fundamental differences in their optimization procedures—a simple alternative that has been long overlooked. Yet, we show that the more primary characters bearing secondary (dependent) traits there are in a data set, the harder it is to estimate the true phylogenetic tree, regardless of the optimality criterion, owing to a considerable expansion of the tree parameter space. [Bayesian inference, character dependency, character coding, distance metrics, morphological phylogenetics, maximum parsimony, performance, phylogenetic accuracy.] 

Abstract Genome assemblies are growing at an exponential rate and have proved indispensable for studying evolution but the effort has been biased toward vertebrates and arthropods with a particular focus on insects. Onychophora or velvet worms are an ancient group of cryptic, soil dwelling worms noted for their unique mode of prey capture, biogeographic patterns, and diversity of reproductive strategies. They constitute a poorly understood phylum of exclusively terrestrial animals that is sister group to arthropods. Due to this phylogenetic position, they are crucial in understanding the origin of the largest phylum of animals. Despite their significance, there is a paucity of genomic resources for the phylum with only one highly fragmented and incomplete genome publicly available. Initial attempts at sequencing an onychophoran genome proved difficult due to its large genome size and high repeat content. However, leveraging recent advances in long-read sequencing technology, we present here the first annotated draft genome for the phylum. With a total size of 5.6Gb, the gigantism of the Epiperipatus broadwayi genome arises from having high repeat content, intron size inflation, and extensive gene family expansion. Additionally, we report a previously unknown diversity of onychophoran hemocyanins that suggests the diversification of copper-mediated oxygen carriers occurred independently in Onychophora after its split from Arthropoda, parallel to the independent diversification of hemocyanins in each of the main arthropod lineages. 

Abstract We describe a stochastic, dynamical system capable of inference and learning in a probabilistic latent variable model. The most challenging problem in such models—sampling the posterior distribution over latent variables—is proposed to be solved by harnessing natural sources of stochasticity inherent in electronic and neural systems. We demonstrate this idea for a sparse coding model by deriving a continuous-time equation for inferring its latent variables via Langevin dynamics. The model parameters are learned by simultaneously evolving according to another continuous-time equation, thus bypassing the need for digital accumulators or a global clock. Moreover, we show that Langevin dynamics lead to an efficient procedure for sampling from the posterior distribution in the L0 sparse regime, where latent variables are encouraged to be set to zero as opposed to having a small L1 norm. This allows the model to properly incorporate the notion of sparsity rather than having to resort to a relaxed version of sparsity to make optimization tractable. Simulations of the proposed dynamical system on both synthetic and natural image data sets demonstrate that the model is capable of probabilistically correct inference, enabling learning of the dictionary as well as parameters of the prior. 

We describe the design and performance of a high-fidelity wearable head-, body-, and eye-tracking system that offers significant improvement over previous such devices. This device’s sensors include a binocular eye tracker, an RGB-D scene camera, a high-frame-rate scene camera, and two visual odometry sensors, for a total of ten cameras, which we synchronize and record from with a data rate of over 700 MB/s. The sensors are operated by a mini-PC optimized for fast data collection, and powered by a small battery pack. The device records a subject’s eye, head, and body positions, simultaneously with RGB and depth data from the subject’s visual environment, measured with high spatial and temporal resolution. The headset weighs only 1.4 kg, and the backpack with batteries 3.9 kg. The device can be comfortably worn by the subject, allowing a high degree of mobility. Together, this system overcomes many limitations of previous such systems, allowing high-fidelity characterization of the dynamics of natural vision. 

This article reviews recent progress in the development of the computing framework Vector Symbolic Architectures (also known as Hyperdimensional Computing). This framework is well suited for implementation in stochastic, nanoscale hardware and it naturally expresses the types of cognitive operations required for Artificial Intelligence (AI). We demonstrate in this article that the ring-like algebraic structure of Vector Symbolic Architectures offers simple but powerful operations on highdimensional vectors that can support all data structures and manipulations relevant in modern computing. In addition, we illustrate the distinguishing feature of Vector Symbolic Architectures, “computing in superposition,” which sets it apart from conventional computing. This latter property opens the door to efficient solutions to the difficult combinatorial search problems inherent in AI applications. Vector Symbolic Architectures are Turing complete, as we show, and we see them acting as a framework for computing with distributed representations in myriad AI settings. This paper serves as a reference for computer architects by illustrating techniques and philosophy of VSAs for distributed computing and relevance to emerging computing hardware, such as neuromorphic computing. 

Abstract The name “millipede” translates to a thousand feet (from mille “thousand” and pes “foot”). However, no millipede has ever been described with more than 750 legs. We discovered a new record-setting species of millipede with 1,306 legs, Eumillipes persephone , from Western Australia. This diminutive animal (0.95 mm wide, 95.7 mm long) has 330 segments, a cone-shaped head with enormous antennae, and a beak for feeding. A distant relative of the previous record holder, Illacme plenipes from California, it belongs to a different order, the Polyzoniida. Discovered 60 m below ground in a drill hole created for mineral exploration, E. persephone possesses troglomorphic features; it lacks eyes and pigmentation, and it has a greatly elongated body—features that stand in stark contrast to its closest surface-dwelling relatives in Australia and all other members of its order. Using phylogenomics, we found that super-elongation (> 180 segments) evolved repeatedly in the millipede class Diplopoda. The striking morphological similarity between E. persephone and I. plenipes is a result of convergent evolution, probably for locomotion in similar soil habitats. Discovered in the resource-rich Goldfields-Esperance region and threatened by encroaching surface mining, documentation of this species and conservation of its habitat are of critical importance.